The Deduction Theorem for Quantum Logic - Some Negative Results
نویسنده
چکیده
We prove that no logic (i.e.consequence operation) determined by any class of orthomodular lattices admits the deduction theorem (Theorem 2.7). We extend those results to some broader class of logics determined by ortholattices (Corollary 2.6).
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملAn Automated Deduction of the Independence of the Axioms of the Megill-Pavičić Formulation of Ortholattice Theory
The optimization of quantum computing circuitry and compilers at some level must be expressed in terms of quantum-mechanical behaviors and operations. In much the same way that the structure of conventional propositional logic is the logic of the description of the behavior of classical physical systems and is isomorphic to a Boolean lattice, so also the algebra, C(H), of closed linear subspace...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملA New Approach to Quantum Logic
. The reason for including this chapter is to make the book as selfcontained as possible. It should in particular be accessible to physicists, who normally have no training in formal logic. We present the basics of classical propositional logic and non-monotonic logic. In fact, it is possible to provide the reader with all the logical equipment he needs in order to understand the logical invest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 55 شماره
صفحات -
تاریخ انتشار 1990